Minimal Classical Logic and Control Operators

نویسندگان

  • Zena M. Ariola
  • Hugo Herbelin
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Degeneracy of Σ-Types in Presence of Computational Classical Logic

We show that a minimal dependent type theory based on Σtypes and equality is degenerated in presence of computational classical logic. By computational classical logic is meant a classical logic derived from a control operator equipped with reduction rules similar to the ones of Felleisen’s C or Parigot’s μ operators. As a consequence, formalisms such as Martin-Löf’s type theory or the (Set-pre...

متن کامل

An Intuitionistic Logic for Sequential Control

We introduce a propositional logic ICL, which adds to intuitionistic logic elements of classical reasoning without collapsing it into classical logic. This logic includes a new constant for false, which augments false in intuitionistic logic and in minimal logic. We define Kripke models for ICL and show how they translate to several other forms of semantics. We define a sequent calculus and pro...

متن کامل

On the Curry-Howard Interpretation of a Fragment of Classical Linear Logic with Subexponentials

We construct a partially-ordered hierarchy of delimited control operators similar to those of the CPS hierarchy of Danvy and Filinski [6]. However, instead of relying on nested CPS translations, these operators give directly a Curry-Howard interpretation of a fragment of linear logic extended with subexponentials, i.e., multiple pairs of ! and ?. We show how the fundamental problem of delimited...

متن کامل

Delimited control operators prove Double-negation Shift

We propose an extension of minimal intuitionistic predicate logic, based on delimited control operators, that can derive the predicate-logic version of the Double-negation Shift schema, while preserving the disjunction and existence properties.

متن کامل

Mixed logic and storage operators

In 1990 J-L. Krivine introduced the notion of storage operators. They are λ-terms which simulate call-by-value in the call-by-name strategy and they can be used in order to modelize assignment instructions. J-L. Krivine has shown that there is a very simple second order type in AF2 type system for storage operators using Gődel translation of classical to intuitionistic logic. In order to modeli...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003